How to Find Smooth Parts of Integers

نویسنده

  • DANIEL J. BERNSTEIN
چکیده

Let P be a finite set of primes, and let S be a finite sequence of positive integers. This paper presents an algorithm to find the largest P smooth divisor of each integer in S. The algorithm takes time b(lg b)2+o(1), where b is the total number of bits in P and S. A previous algorithm by the author takes time b(lg b)3+o(1) to find all the factors from P of each integer in S; a variant by Franke, Kleinjung, Morain, and Wirth usually takes time b(lg b)2+o(1) to find the largest P -smooth divisor of each integer in S; the algorithm in this paper always takes time b(lg b)2+o(1) to find the largest P smooth divisor of each integer in S.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative Energy of Polynomial Images of Intervals Modulo q ∗ †

Given a smooth integer q, we use existing upper bounds for character sums to find a lower bound for the size of a multiplicative subgroup of the integers modulo q which contains the image of an interval of consecutive integers I ⊂ Zq under a polynomial f ∈ Z[X].

متن کامل

Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

متن کامل

Sharp Transitions in Making Squares

In many integer factoring algorithms, one produces a sequence of integers (created in a pseudo-random way), and wishes to determine a subsequence whose product is a square. A good model for how this sequence is generated is the following process introduced by Pomerance in his 1994 invited ICM lecture: Select integers a1, a2, . . . , at random from the interval [1, x], until some subsequence pro...

متن کامل

Asymmetric Behavior of Inflation in Iran: New Evidence on Inflation Persistence Using a Smooth Transition Model

T his paper investigates the asymmetric behavior of inflation. We use logistic smooth transition autoregressive (LSTAR) model to characterize the regime-switching behavior of Iran’s monthly inflation during the period May 1990 to December 2013. We find that there is a triple relationship between the inflation level, its fluctuations and persistence. The findings imply that the behavi...

متن کامل

On a sequence related to the coprime integers

The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004